Temporal Resolution: A Breadth-First Search Approach
نویسنده
چکیده
An approach to applying clausal resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states and temporal resolution between states. The method consists of only one temporal resolution rule and is therefore particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of this temporal resolution rule is the most costly part of the method, involving search amongst graphs, it is on this area we focus. A breadth-rst search approach to the application of this rule is presented and shown to be correct. Analysis of its operation is carried out and test results for its comparison to a previously developed depth-rst style algorithm given.
منابع مشابه
A Temporal Argumentation Approach to Cooperative Planning Using Dialogues
In this paper, we study a dialogue-based approach to multi-agent collaborative plan search in the framework of t-DeLP, an extension of DeLP for defeasible temporal reasoning. In t-DeLP programs, temporal facts and rules combine into arguments, which compare against each other to decide which of their conclusions are to prevail. By adding temporal actions for multiple agents to this argumentativ...
متن کاملA Breadth-First Approach to Memory-Efficient Graph Search
Recent work shows that the memory requirements of A* and related graph-search algorithms can be reduced substantially by only storing nodes that are on or near the search frontier, using special techniques to prevent node regeneration, and recovering the solution path by a divide-and-conquer technique. When this approach is used to solve graph-search problems with unit edge costs, we have shown...
متن کاملCombining Breadth-First and Depth-First Strategies in Searching for Treewidth
Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits of this approach using the treewidth problem as an example.
متن کاملParallel Breadth-First Heuristic Search on a Shared-Memory Architecture
We consider a breadth-first approach to memory-efficient graph search and discuss how to parallelize it on a sharedmemory architecture that uses multithreading to achieve parallelism. The approach we develop for parallelizing breadthfirst search uses layer synchronization, in which threads expand all nodes in one layer of the breadth-first search graph before considering any nodes in the next l...
متن کاملAutomatic Adaptive Segmentation of Moving Objects Based on Spatio-Temporal Information
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We formulate the problem as a connectivity analysis of region adjacency graph (RAG) based on temporal information. The nodes of the RAG represent homogeneous regions and the edges represent temporal information, which is ob...
متن کامل